On Dedekind's problem for complete simple games
نویسندگان
چکیده
We combine the parametric Barvinok algorithm with a generation algorithm for a finite list of suitably chosen discrete sub-cases on the enumeration of complete simple games, i. e. a special subclass of monotone Boolean functions. Recently, Freixas et al. have proven an enumeration formula for complete simple games with two types of voters. We will provide a shorter proof and an enumeration formula for complete simple games with two shift-minimal winning vectors.
منابع مشابه
Growth of dimension in complete simple games
The concept of dimension in simple games was introduced by Taylor and Zwicker (1993) as a measure of the remoteness of a given game from a weighted game. They demonstrated that the dimension of a simple game can grow exponentially in the number of players. However, the problem of worst-case growth of the dimension in complete games was left open. Freixas and Puente (2008) showed that complete g...
متن کاملComparison of the effectiveness of cognitive computer games and parent-child interactive games on problem solving and positive and negative affect of ten-year-old children in Shiraz
In recent years, research on increasing cognitive and psychological status through play has received much attention. For this purpose, there are two categories of game including interactive home game and cognitive game that the first run in the home environment and the latter is implemented as computer software to increase cognitive abilities. The aim of this study was to compare the effectiven...
متن کاملComplexity of comparison of influence of players in simple games
Coalitional voting games appear in different forms in multi-agent systems, social choice and threshold logic. In this paper, the complexity of comparison of influence between players in coalitional voting games is characterized. The possible representations of simple games considered are simple games represented by winning coalitions, minimal winning coalitions, weighted voting game or a multip...
متن کاملSpanning connectivity games
The Banzhaf index, Shapley-Shubik index and other voting power indices measure the importance of a player in a coalitional game. We consider a simple coalitional game called the spanning connectivity game (SCG) based on an undirected, unweighted multigraph, where edges are players. We examine the computational complexity of computing the voting power indices of edges in the SCG. It is shown tha...
متن کاملEnumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum
This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class as well. Second, we focus on the special case of bipartite complete games with minimum, and we compare and rank these games according to the behavior of some...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Game Theory
دوره 42 شماره
صفحات -
تاریخ انتشار 2013